Toric Codes and Lattice Ideals
نویسنده
چکیده
Let X be a complete simplicial toric variety over a finite field Fq with homogeneous coordinate ring S = Fq[x1, . . . , xr] and split torus TX ∼= (Fq). We prove that vanishing ideal of a subset Y of the torus TX is a lattice ideal if and only if Y is a subgroup. We show that these subgroups are exactly those subsets that are parameterized by Laurents monomials. We give an algorithm for determining this parametrization if the subgroup is the zero locus of a lattice ideal in the torus. We also show that vanishing ideals of subgroups of TX are radical homogeneous lattice ideals of dimension r − n. We identify the lattice corresponding to a degenerate torus in X and completely characterize when its lattice ideal is a complete intersection. We compute dimension and length of some generalized toric codes defined on these degenerate tori.
منابع مشابه
Matchings in simplicial complexes, circuits and toric varieties
Using a generalized notion of matching in a simplicial complex and circuits of vector configurations, we compute lower bounds for the minimum number of generators, the binomial arithmetical rank and the A-homogeneous arithmetical rank of a lattice ideal. Prime lattice ideals are toric ideals, i.e. the defining ideals of toric varieties. © 2006 Elsevier Inc. All rights reserved.
متن کاملToric Ideals of Lattice Path Matroids and Polymatroids
We show that the toric ideal of a lattice path polymatroid is generated by quadrics corresponding to symmetric exchanges, and give a monomial order under which these quadrics form a Gröbner basis. We then obtain an analogous result for lattice path matroids.
متن کاملOn the Fan Associated to a Linear Code
We will show how one can compute all reduced Gröbner bases with respect to a degree compatible ordering for code ideals even though these binomial ideals are not toric. To this end, the correspondence of linear codes and binomial ideals will be briefly described as well as their resemblance to toric ideals. Finally, we will hint at applications of the degree compatible Gröbner fan to the code e...
متن کاملSyzygies of Codimension 2 Lattice Ideals
The study of semigroup algebras has a long tradition in commutative algebra. Presentation ideals of semigroup algebras are called toric ideals, in reference to their prominent role in geometry. In this paper we consider the more general class of lattice ideals. Fix a polynomial ring S = k[x1, . . . , xn] over a field k and identify monomials x in S with vectors a ∈ N. Let L be any sublattice of...
متن کاملLattice polytopes in coding theory
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also include a new inductive bound for the minimum distance of generalized toric codes. As an application, we give new formulas for the minimum distance of generalized toric codes for special lattice point configurations. 2010 MSC: 14M25, 14G50,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.00747 شماره
صفحات -
تاریخ انتشار 2017